Descriptional complexity of multi-parallel grammars
نویسنده
چکیده
This paper studies the descriptional complexity of multi-parallel grammars with respect to the number of nonterminals and selectors, and the length of these selectors. As a result, it proves that every recursively enumerable language is generated by a multi-parallel grammar with no more than seven nonterminals and four selectors of length five.
منابع مشابه
On Descriptional Complexity of Partially Parallel Grammars
This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no more than two selectors, or (iii) by a three-...
متن کاملDescriptional Complexity of Generalized Forbidding Grammars
This paper discusses the descriptional complexity of generalized forbidding grammars in context of degrees, numbers of nonterminals and conditional productions, and a new descriptional complexity measure—an index—of generalized forbidding grammars.
متن کاملA Note on the Descriptional Complexity of Semi-Conditional Grammars
The descriptional complexity of semi-conditional grammars is studied. A proof that every recursively enumerable language is generlji";'I":ff f iru*::?H:"ffi Xl,?li".ffi f iJ,,-,T?,ll,J"'"'n'"
متن کاملDescriptional complexity of semi-conditional grammars
The descriptional complexity of semi-conditional grammars is studied. It is proved that every recursively enumerable language is generated by a semi-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals.
متن کاملGenerating all permutations by context-free grammars in Greibach normal form
We consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach m-form (m = 1, 2) which generates the finite language Ln of all n! strings that are permutations of n different symbols (n ≥ 1). These grammars are investigated with respect to their descriptional complexity, i.e., we determine the number of nonterminal symbols and the number of production rules of Gn as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 108 شماره
صفحات -
تاریخ انتشار 2008